EMBEDDING OF CIRCULANT NETWORKS INTO k-ROOTED SIBLING TREES
نویسندگان
چکیده
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength and dilation of embedding circulant networks into k-rooted sibling trees. AMS Subject Classification: 05C78, 05C85
منابع مشابه
4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملEmbedding trees in recursive circulants a
We present the results concerning the embedding of trees into recursive circulants. Recursive circulant G(N,:,/) is a circulant graph with N vertices and jumps of powers of d. We present dilation 1 embedding of Fibonacci trees and full quaternaly trees in G(Z”, 2), and full binary trees and hinomial trees in G(2”,4).
متن کاملOn the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2
Two spanning trees of a graph G are said to be independent if they are rooted at the same vertex r, and for each vertex v 6= r in G, the two different paths from v to r, one path in each tree, are internally disjoint. A set of spanning trees of G is independent if they are pairwise independent. A recursive circulant graph G(N, d) has N = cdm vertices labeled from 0 to N − 1, where d > 2, m > 1,...
متن کاملEmbedding Circulant Networks into Butterfly and Benes Networks
The dilation of an embedding is defined as the maximum distance between pairs of vertices of host graph that are images of adjacent vertices of guest graph. An embedding with a long dilation faces many problems, such as long communication delay, coupling problems and the existence of different types of uncontrolled noise. In this paper, we compute the minimum dilation of embedding circulant net...
متن کاملOptimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
The double-rooted complete binary tree is a complete binary tree where the path (of length ) between the children of the root is replaced by a path of length . It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into the hypercube does not pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013